#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N=1e5+5;
int n,cnt;
int r[N];
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d",&r[i]);
    sort(r+1,r+n+1);
    for(int i=1,j=1;i<=n;i++){
        if(r[i]>r[j]){
            cnt++;
            j++;
        }
    }
    printf("%d",n-cnt);
    return 0;
}
